Achieving Capacity of Bi-Directional Tandem Collision Network by Joint Medium-Access Control and Channel-Network Coding
نویسندگان
چکیده
In ALOHA-type packetized network, the transmission times of packets follow a stochastic process. In this paper, we advocate a deterministic approach for channel multiple-access. Each user is statically assigned a periodic protocol signal, which takes value either zero or one, and transmit packets whenever the value of the protocol signal is equal to one. On top of this multiple-access protocol, efficient channel coding and network coding schemes are devised. We illustrate the idea by constructing a transmission scheme for the tandem collision network, for both slot-synchronous and slot-asynchronous systems. This cross-layer approach is able to achieve the capacity region when the network is bi-directional.
منابع مشابه
Compute-and-Forward on a Line Network with Random Access
Signal superposition and broadcast are important features of the wireless medium. Compute-and-Forward, also known as Physical Layer Network Coding (PLNC), is a technique exploiting these features in order to improve performance of wireless networks. More precisely, it allows wireless terminals to reliably decode a linear combination of all messages, when a superposition of the messages is recei...
متن کاملJoint Network and LDPC Coding for Bi-directional Relaying
In this paper, we consider joint network and LDPC coding for practically implementing the denosie-and-forward protocol over bi-directional relaying. the closed-form expressions for computing the log-likelihood ratios of the network-coded codewords have been derived for both real and complex multipleaccess channels. It is revealed that the equivalent channel observed at the relay is an asymmetri...
متن کاملمحاسبه ظرفیت شبکه عصبی هاپفیلد و ارائه روش عملی افزایش حجم حافظه
The capacity of the Hopfield model has been considered as an imortant parameter in using this model. In this paper, the Hopfield neural network is modeled as a Shannon Channel and an upperbound to its capacity is found. For achieving maximum memory, we focus on the training algorithm of the network, and prove that the capacity of the network is bounded by the maximum number of the ortho...
متن کاملA Busy-tone Based Directional Mac Protocol for Ad Hoc Networks
In mobile wireless ad hoc networking environments, such as the Future Combat System (FCS), the shared wireless communication medium is an inherently limited resource and is collision prone. In this paper, we propose to adapt the Dual Busy Tone Multiple Access (DBTMA) protocol for use with directional antennas, which further increases effective channel capacity. In contrast to other directional ...
متن کاملUsing Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages
In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0909.5007 شماره
صفحات -
تاریخ انتشار 2009